Efficient Mining Maximal Variant Usage and Low Usage Biclusters in Discrete Function-Resource Matrix
نویسندگان
چکیده
The functional layer is the pillar of the whole prognostics and health management system. Its effectiveness is the core of system task effectives. In this paper, we proposed a new bicluster mining algorithm: DoCluster, to effectively mine all biclusters with maximal variant usage rate and low usage rate in the discrete function-resource matrix. In order to improve the mining efficiency, DoCluster algorithm constructs a sample weighted graph firstly; secondly, all biclusters with maximal variant usage rate and low usage rate satisfying the variant usage rate and low usage rate definition are mined using sample-growth and depth-first method in the constructed weighted graph. DoCluster algorithm also uses several pruning strategies to ensure the mining of maximal bicluster without candidate maintenance. The experimental results show DoCluster algorithm is more efficient than other two algorithms.
منابع مشابه
Binary Particle Swarm Optimization based Biclustering of Web usage Data
Web mining is the nontrivial process to discover valid, novel, potentially useful knowledge from web data using the data mining techniques or methods. It may give information that is useful for improving the services offered by web portals and information access and retrieval tools. With the rapid development of biclustering, more researchers have applied the biclustering technique to different...
متن کاملEfficient Mining Differential Co-Expression Constant Row Bicluster in Real-Valued Gene Expression Datasets
Biclustering aims to mine a number of co-expressed genes under a set of experimental conditions in gene expression dataset. Recently, differential co-expression biclustering approach has been used to identify class-specific biclusters between two gene expression datasets. However, it cannot handle differential co-expression constant row biclusters efficiently in real-valued datasets. In this pa...
متن کاملEfficient mining of maximal biclusters in mixed-attribute datasets
This paper presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets, with or without missing values. The independent attributes are mixed or heterogeneous, in the sense that both numerical (real or integer values) and categorical (ordinal or nominal values) attribute types may appear together in the same dataset. The proposal is an ...
متن کاملDilations, models, scattering and spectral problems of 1D discrete Hamiltonian systems
In this paper, the maximal dissipative extensions of a symmetric singular 1D discrete Hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the Hilbert space ℓ_{Ω}²(Z;C²) (Z:={0,±1,±2,...}) are considered. We consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. For each of these cases we establish a self...
متن کاملEfficient Mining Frequent Closed Discriminative Biclusters by Sample-Growth: The FDCluster Approach
DNA microarray technology has generated a large number of gene expression data. Biclustering is a methodology allowing for condition set and gene set points clustering simultaneously. It finds clusters of genes possessing similar characteristics together with biological conditions creating these similarities. Almost all the current biclustering algorithms find bicluster in one microarray datase...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 9 شماره
صفحات -
تاریخ انتشار 2014